A graph coloring constructive hyper-heuristic for examination timetabling problems
نویسندگان
چکیده
منابع مشابه
A graph-based hyper-heuristic for educational timetabling problems
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Within the hyperheuristic framework, a Tabu Search approach is employed to search for permutations of graph heuristics which are used for constructing timetables in exam and course timetabling problems. This underpins a m...
متن کاملGreat-deluge hyper-heuristic for examination timetabling
Hyper-heuristics can be identified as methodologies that search the space generated by a finite set of low level heuristics for solving search problems. An iterative hyper-heuristic framework can be thought of as requiring a single candidate solution and multiple perturbation low level heuristics. An initially generated complete solution goes through two successive processes (heuristic selectio...
متن کاملA Reinforcement Learning - Great-Deluge Hyper-Heuristic for Examination Timetabling
Hyper-heuristics can be identified as methodologies that search the space generated by a finite set of low level heuristics for solving search problems. An iterative hyper-heuristic framework can be thought of as requiring a single candidate solution and multiple perturbation low level heuristics. An initially generated complete solution goes through two successive processes (heuristic selectio...
متن کاملHybridisations within a Graph Based Hyper-heuristic Framework for University Timetabling Problems
A significant body of literature has explored various research directions in hyper-heuristics (which can be thought as heuristics to choose heuristics). In this paper we define a graph based hyper-heuristic (GHH) framework and compare the performance of a number of local search based searching algorithms as the high level heuristics. They are used to search upon permutations of low level graph ...
متن کاملHybridizations within a graph-based hyper-heuristic framework for university timetabling problems
A significant body of recent literature has explored various research directions in hyperheuristics (which can be thought as heuristics to choose heuristics). In this paper, we extend our previous work to construct a unified graph based hyper-heuristic (GHH) framework, under which a number of local search based algorithms as the high level heuristics are studied to search upon sequences of low ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Intelligence
سال: 2011
ISSN: 0924-669X,1573-7497
DOI: 10.1007/s10489-011-0309-9